Thirty Years of Flexible Job-Shop Scheduling: A Bibliometric Study

نویسندگان

چکیده

Industry 4.0 introduced a new change in paradigms and technologies the industry. In shop schedule, it gains holistic viewpoint online demands, real-time reactive methodologies. Developments scheduling area are critical to success. First addressed by Brucker Schlie 1990, Flexible Job-Shop Scheduling Problem has been attracting researchers practitioners over last decades. This body of research may be helpful address industry high flexibility problems. article uses bibliometric approach study three decades on this problem. The main results identify most prolific areas, journals, institutions, countries, authors, co-citation networks that revealed influential as well their relevant works. A conceptual analysis based keywords burst occurrences helped latest evolution trends; allowing recognize alignments gaps within 4.0.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible job shop scheduling under availability constraints

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

متن کامل

Flexible Job-Shop Scheduling Problems

Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...

متن کامل

flexible job shop scheduling under availability constraints

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

متن کامل

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

Reactive Search for Flexible Job Shop Scheduling

In the classical job shop scheduling problem (JSSP), n jobs are processed to completion on m unrelated machines. Each job requires processing on each machine exactly once. For each job, technology constraints specify a complete, distinct routing which is fixed and known in advance. Processing times are sequence-independent, fixed, and known in advance. Each machine is continuously available fro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2021

ISSN: ['1877-0509']

DOI: https://doi.org/10.1016/j.procs.2021.01.329